Error exponents in scalable source coding
نویسندگان
چکیده
The characterization of the set of achievable rate and distortion values for scalable source coding is extended to additionally account for error exponents, namely, the negative normalized asymptotic log likelihood of error events at different layers. The “error” at each layer is defined as the event that the source block is not reproduced within the prespecified fidelity at the corresponding decoder. We consider separate error events at each layer so as to allow a tradeoff analysis for the error exponents when the rate and distortion values are fixed. For two-step coding of discrete memoryless sources, we derive a single-letter characterization of the region of all achievable 6-tuples ( ), i.e., the rate, error exponent, and distortion levels at each layer. We also analyze the special case of successive refinability, where ( ) and ( ) individually achieve the nonscalable bounds. A surprising outcome of the analysis is that for any , , and , there exists a finite threshold ^ such that successive refinability is ensured for all ^ .
منابع مشابه
Scalable Source Coding Bounds : Analysis , Computation , and Applications
Scalable Source Coding Bounds: Analysis, Computation, and Applications by Ertem Tuncel This dissertation is concerned with scalable source coding, a class of compression techniques that enable users to access a single encoded bitstream in various resolutions. The general coding scheme, as well as its application-driven extensions and its constrained variants, are considered in a rate-distortion...
متن کاملNetwork Coding for Correlated Sources
We consider the ability of a distributed randomized network coding approach to multicast, to one or more receivers, correlated sources over a network where compression may be required. We give, for two arbitrarily correlated sources in a general network, upper bounds on the probability of decoding error at each receiver, in terms of network parameters. In the special case of a Slepian-Wolf sour...
متن کاملI-Projection and the Geometry of Error Exponents
We present a geometric approach, using Iprojections [4], for analyzing error exponents in various information theory problems—e.g., hypothesis-testing, source coding, and channel coding. By illuminating on the hidden geometrical structure, it also clarifies the distribution of the log likelihood for correct and incorrect codewords. Calculating the error exponent for very noisy channels becomes ...
متن کاملJoint source-channel coding for scalable video using models of rate-distortion functions
A joint source-channel coding scheme for scalable video is developed in this paper. An SNR scalable video coder is used and Unequal Error Protection (UEP) is allowed for each scalable layer. Our problem is to allocate the available bit rate across scalable layers and, within each layer, between source and channel coding, while minimizing the end-to-end distortion of the received video sequence....
متن کاملOptimum Tradeoffs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian-Wolf Coding
We analyze the asymptotic performance of ensembles of random binning Slepian-Wolf codes, where each type class of the source might have a different coding rate. In particular, we first provide the exact encoder excess rate exponent as well as the decoder error exponent. Then, using the error exponent expression, we determine the optimal rate function, namely, the minimal rate for each type clas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2003